A Unifying Framework for Perturbative Exponential Factorizations
نویسندگان
چکیده
We propose a framework where Fer and Wilcox expansions for the solution of differential equations are derived from two particular choices initial transformation that seeds product expansion. In this scheme, intermediate can also be envisaged. Recurrence formulas developed. A new lower bound convergence expansion is provided, as well some applications results. particular, examples worked out up to high order approximation illustrate behavior
منابع مشابه
Generalized Matrix Factorizations as a Unifying Framework for Pattern Set Mining: Complexity Beyond Blocks
Matrix factorizations are a popular tool to mine regularities from data. There are many ways to interpret the factorizations, but one particularly suited for data mining utilizes the fact that a matrix product can be interpreted as a sum of rank-1 matrices. Then the factorization of a matrix becomes the task of finding a small number of rank-1 matrices, sum of which is a good representation of ...
متن کاملA Unifying Framework for Conceptual Data Modelling Concepts a Unifying Framework for Conceptual Data Modelling Concepts
For succesful information systems development, conceptual data modelling is essential. Nowadays many techniques for conceptual data modelling exist, examples are NIAM, FORM, PSM, many (E)ER variants, IFO, and FDM. In-depth comparisons of concepts of these techniques is very diicult as the mathematical formalisations of these techniques, if existing at all, are very diierent. As such there is a ...
متن کاملA Unifying Framework for ALP , CLP
This paper presents the TPCALP framework, a theorem-proving approach which aims to unify Abductive Logic Programming (ALP), Constraint Logic Programming (CLP) and Semantic Query Optimization (SQO). The framework combines the use of deenitions, as in ordinary logic programming, with the use of integrity constraints, as in ALP and SQO. The programmer can choose to represent knowledge in either fo...
متن کاملa unifying framework for hypertext systems
This copy has been supplied on the understanding that it is copyright material. Duplication or sale of all or part of any of the GRO Data Collections is not permitted, and no quotation or excerpt from the work may be published without the prior written consent of the copyright holder/s. Abstract. A report is given on work undertaken to produce a struc-tured speciication in Z of a model which ai...
متن کاملA unifying Framework for Distributed Routing Algorithms
Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing strategies to arbitrary topologies, this paper presents a classification framework for distributed routing algorithms. Using this framework, ideas previously presented in a topologyspecific context may be applied to new net...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9060637